Prevention of Kernel Memory Corruption Using Kernel Page Restriction Mechanism

نویسندگان

چکیده

An adversary's user process can compromise the security of operating system (OS) kernel, and subsequent invocation vulnerable kernel code cause memory corruption. The could overwrite data containing privilege information processes or related to features (i.e., mandatory access control). As a means protection, OS researchers have proposed multiple address space approach that partitions protect from corruption (e.g., process-local call isolation). However, in previous approach, targeted for attack still reside same memory. Consequently, adversaries simply focus on calling latest code, which relies starting points process. With aim preventing such subversion attacks, this paper proposes page restriction mechanism (KPRM), employs an alternative design method obviate objective KPRM is prohibit execution prevent writing ensures unmapping exploitation due vulnerability. Therefore, obstructed executing overwriting running kernel. Evaluation results indicate actual proof-of-concept attacks resulting successfully be prevented by KPRM. Moreover, implementations maximum latency calls 0.703µs, while overhead 100,000 Hypertext Transfer Protocol (HTTP) downloads via web client program ranged 1.188% 4.093% overhead. In addition, achieved acceptable overheads 2.459% 2.193% compile time.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Memory Efficient Kernel Approximation

Scaling kernel machines to massive data sets is a major challenge due to storage and computation issues in handling large kernel matrices, that are usually dense. Recently, many papers have suggested tackling this problem by using a low-rank approximation of the kernel matrix. In this paper, we first make the observation that the structure of shift-invariant kernels changes from low-rank to blo...

متن کامل

Flexible Kernel Memory

This paper introduces a new model of associative memory, capable of both binary and continuous-valued inputs. Based on kernel theory, the memory model is on one hand a generalization of Radial Basis Function networks and, on the other, is in feature space, analogous to a Hopfield network. Attractors can be added, deleted, and updated on-line simply, without harming existing memories, and the nu...

متن کامل

Kernel-Kernel communication in a shared-memory multiprocessor

In the standard kernel organization on a bus-based multiprocessor, all processors share the code and data of the operating system; explicit synchronization is used to control access to kernel data structures. Distributed-memory multicomputers use an alternative approach, in which each instance of the kernel performs local operations directly and uses remote invocation to perform remote operatio...

متن کامل

Kernel-Kernel Communication in a Shared-Memory Multiprocessor t

In the standard kernel organization on a shared-memory multiprocessor all processors share the code and data of the operating system; explicit synchronization is used to control access to kernel data structures. Distributed-memory multicomputers use an alternative approach, in which each instance of the kernel performs local operations directly and uses remote invocation to perform remote opera...

متن کامل

Towards Linux Kernel Memory Safety

Œe security of billions of devices worldwide depends on the security and robustness of the mainline Linux kernel. However, the increasing number of kernel-specific vulnerabilities, especially memory safety vulnerabilities, shows that the kernel is a popular and practically exploitable target. Two major causes of memory safety vulnerabilities are reference counter overflows (temporal memory erro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of information processing

سال: 2022

ISSN: ['0387-6101']

DOI: https://doi.org/10.2197/ipsjjip.30.563